Commanding Cooperative UGV-UAV With Nested Vehicle Routing for Emergency Resource Delivery
نویسندگان
چکیده
منابع مشابه
Using Petri Net Plans for Modeling UAV-UGV Cooperative Landing
Aerial and ground vehicles working in corporation are crucial assets for several real world applications, ranging from search and rescue to logistics. In this paper, we consider a cooperative landing task problem, where an unmanned aerial vehicle (UAV) must land on an unmanned ground vehicle (UGV) while such ground vehicle is moving in the environment to execute its own mission. To solve this c...
متن کاملCooperative vehicle routing problem: an opportunity for cost saving
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
متن کاملCooperative UAV-UGV modeled by Petri Net Plans specification
Aerial and ground vehicles working in corporation are crucial assets for several real world applications, ranging from search and rescue to logistics. Here we turn our attention to high level languages or team plans [3, 2, 4, 1] for modeling a cooperative scenario, where the UAV/UGV team should operate in tight cooperation to perform a joint task. In this context, by tight coordination we mean ...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3040790